A Formulation of Deterministic Bottom - UpParsing and Parser Generation In

نویسنده

  • Chuck Liang
چکیده

This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for a logic programming language is described.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language

This paper addresses eecient parsing in the context of logical inference for the purpose of using logic programming languages in compiler writing. A bottom-up, deterministic parsing mechanism is formulated for \bounded right context" grammars, a subclass of LR(k) grammars with characteristics amenable to declarative parser speciica-tion. A working parser generator for Prolog is described, altho...

متن کامل

A generic parser for strings and trees

In this paper, we propose a two fold generic parser. First, it simulates the behavior of multiple parsing automata. Second, it parses strings drawn from either a context free grammar, a regular tree grammar, or from both. The proposed parser is based on an approach that defines an extended version of an automaton, called positionparsing automaton (PPA) using concepts from LR and regular tree au...

متن کامل

Deterministic and Bottom-Up Parsing in Prolog

It is well kncwn that top-dcwn backtracking context free parsers are easy towrite in Prolog, and that these parsers can be extended to give them the per of ATN's. This report shows that a number of other familiar parser designs can be very naturally implemented in Prolog. The top-dotJn parsers can easily be constrained to do deterministic parsing of m(k) languages. Bottcm-up backtrack parsers c...

متن کامل

The Deterministic Generation of Extreme Surface Water Waves Based on Soliton on Finite Background in Laboratory

This paper aims to describe a deterministic generation of extreme waves in a typical towing tank. Such a generation involves an input signal to be provided at the wave maker in such a way that at a certain position in the wave tank, say at a position of a tested object, a large amplitude wave emerges. For the purpose, we consider a model called a spatial-NLS describing the spatial propagation o...

متن کامل

Efficient Parsing for Word Structure

We describe an efficient parser for morphological analysis for a theory of X′-selection within the Strict Asymmetry framework. The bottom-up parser is based on a full LR(1) analyzer, modified to handle the processing of both overt and covert morphemes in a locally deterministic and efficient manner.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999